Computational Complexity of Some Problems Involving Congruences on Algebras
نویسندگان
چکیده
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra generated by a set of pairs, and determining whether a given algebra is simple or subdirectly irreducible. We also consider the problem of determining the smallest fully invariant congruence on a given algebra containing a given set of pairs. We prove that this problem is complete for nondeterministic
منابع مشابه
A new branch of the logical algebra: UP-algebras
In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...
متن کاملHvMV-ALGEBRAS II
In this paper, we continue our study on HvMV-algebras. The quotient structure of an HvMV-algebra by a suitable types of congruences is studied and some properties and related results are given. Some homomorphism theorems are given, as well. Also, the fundamental HvMV-algebra and the direct product of a family of HvMV-algebras are investigated and some related results are obtained.
متن کاملT-FUZZY CONGRUENCES AND T-FUZZY FILTERS OF A BL-ALGEBRA
In this note, we introduce the concept of a fuzzy filter of a BLalgebra,with respect to a t-norm briefly, T-fuzzy filters, and give some relatedresults. In particular, we prove Representation Theorem in BL-algebras. Thenwe generalize the notion of a fuzzy congruence (in a BL-algebra) was definedby Lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.We prove that there i...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کامل(M, N)-Soft Intersection BL-Algebras and Their Congruences
The purpose of this paper is to give a foundation for providing a new soft algebraic tool in considering many problems containing uncertainties. In order to provide these new soft algebraic structures, we discuss a new soft set-(M, N)-soft intersection set, which is a generalization of soft intersection sets. We introduce the concepts of (M, N)-SI filters of BL-algebras and establish some chara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000